Перевод: с английского на русский

с русского на английский

С русского на:
Английский
С английского на:
Русский

polynomial approximation problem

Толкование Перевод

1 polynomial approximation problem

Математика: задача аппроксимации полиномами

Универсальный англо-русский словарь > polynomial approximation problem
2 polynomial approximation problem

задача аппроксимации полиномами

English-Russian scientific dictionary > polynomial approximation problem
3 problem

1) задача; проблема

2) неисправность

3) трудность, затруднение

•

problem with fixed boundaries — задача с неподвижными границами

problem with losses — задача об обслуживании с потерями

problem with movable boundaries — задача с подвижными границами

problem with waiting — задача об обслуживании с ожиданием

to attack a problem — штурмовать проблему

to formulate a problem — формулировать проблему

to work out a problem — разрабатывать проблему

to state a problem — ставить задачу

- absorption problem

- abstract problem

- accompanying problem

- adjoint problem

- advertizing problem

- algebraic problem

- algorithmically unsolvable problem

- applied problem

- approach problem

- arithmetical problem

- assignment problem

- asymptotic problem

- attack-and-defense problem

- augmented problem

- auxiliary problem

- axially symmetric problem

- ballistic problem

- ballot problem

- barrier problem

- basic maximum problem

- betting problem

- bidual problem

- bifurcation problem

- biharmonic problem

- binary problem

- birthday problem

- blending problem

- bottleneck problem

- boundary problem
- boundary value problem
- bounded problem

- bounded-variable problem

- brachistochrone problem

- burglar problem

- cake-cutting problem

- calculability problem

- canonical problem

- capacitated transportation problem
- card matching problem
- cataloguing problem

- caterer problem

- Cauchy problem

- center problem

- center-and-focus problem

- central asymptotic problem
- central limit problem
- chance-constrained problem

- characteristic problem

- characterization problem

- check problem

- classical problem

- classification problem

- closed problem

- coercitive problem

- coexistence problem

- coin-tossing problem

- coin-weighing problem

- coloring problem

- combinatorial problem

- compactness problem

- competitive problem

- compression problem

- computational problem

- conceptual problem

- conjugate problem

- constant problem

- construction problem

- continuum problem

- contract-awards problem

- control problem

- convergence problem

- convex programming problem

- correspondence problem

- counterfeit coin problem

- crossing problem

- dancing problem

- decidability problem

- decision problem under certainty
- decision problem under risk - decision problem under uncertainty
- decoding problem

- degenerate problem

- delivery problem

- diet problem

- differentiation problem

- diffusion problem

- dimensionality problem

- direct problem

- Dirichlet's problem

- disorder problem

- distribution problem

- divisor problem

- domino problem

- econometric problem

- effectivity problem

- eigenvalue problem

- election problem

- embedding problem

- empirical problem

- encounter problem

- entrance-fee problem

- enumerability problem

- enumeration problem

- epistemological problem

- equilibrium problem

- equivalence problem

- equivalent problem

- error minimization problem

- estimation problem

- evolutionary problem

- explosion problem

- extended problem

- extension problem

- extremal problem
- extremum problem - fair division problem
- feasibility problem

- feasible problem

- feed mix problem

- filtering problem

- finitary problem

- five queens problem

- fixed-charge problem

- flow problem

- forecasting problem

- foreman problem

- gambler ruin problem
- gambling problem - gasoline blending problem
- general problem

- generalized problem

- gold-mining problem

- graph-theoretic problem

- halting problem

- hill-climbing problem

- homogeneity problem

- homogeneous problem

- homotopy problem

- identification problem

- identity problem

- ill-conditioned problem

- ill-defined problem

- ill-posed problem

- ill-structured problem

- improperly posed problem
- incompletely structured problem
- index of problem

- infeasible problem

- inference problem

- infinite medium problem

- infinitesimal problem

- information retrieval problem

- inhomogeneous problem

- initial problem

- initial-value problem

- inner problem

- insoluble problem

- integration problem

- interpolation problem

- intractable problem

- intricate problem

- invariant problem

- inverse problem

- inversion problem

- irregular problem

- isometric problem

- isomorphism problem

- isoperimetric problem

- knapsack problem

- knight problem

- labyrinth problem

- lattice search problem

- linear problem

- loading problem

- location problem

- many-body problem

- map-colouring problem

- map-folding problem

- mass problem

- master problem

- matching problem

- mathematical problem

- maximization problem

- maximum-flow problem

- menage problem

- menu problem

- metrization problem

- minimal length problem

- minimax problem

- minimization problem

- mixed problem

- module problem

- moment problem

- monkey-banana problem

- monotonic problem

- moving boundary problem

- multicriterion problem

- multidecision problem

- multidimensional problem

- multiextremal problem

- multiindex problem

- multiple-integral problem

- multivariate problem

- natural problem

- necklace problem

- needle problem

- nested problem

- network flow problem

- network problem

- newspaper-boy problem

- nondifferentiable problem

- nonhomogeneous problem

- nonlinear problem

- nonlinear programming problem

- nonparametric problem

- nonsequential problem

- nonstationary problem

- nonstochastic problem

- non-uniform problem

- nonwell-posed problem

- normal problem

- normative problem

- number problem

- numerical problem

- observation problem

- occupancy problem

- one-armed bandit problem

- one-dimensional problem

- one-sample problem

- open problem

- optimal assignment problem
- optimal path problem - optimal stopping problem
- optimization problem

- optimum problem

- orderability problem

- original problem

- outer problem

- overspecified problem

- packing problem

- parametric dual problem

- parking problem

- partition problem

- percolation problem

- permutation problem

- personnel-assignment problem

- petrol blending problem

- picnic problem

- plane problem

- Plateau's problem

- polar problem

- polynomial approximation problem
- portfolio selection problem
- positional problem

- postman problem

- power moment problem
- precisely specified problem
- prediction problem

- prefix problem

- prey-predator problem

- primal problem

- probabilistic problem

- problem of allocation

- problem of deadly embrace

- problem of derangements

- problem of eight queens

- problem of elimination

- problem of form equivalence

- problem of interpolating

- problem of interpretation

- problem of inverse probability

- problem of localization

- problem of matching

- problem of projectivity

- problem of reduction

- problem of separability

- problem of six red disks

- problem of solvability

- problem of thirteen spheres

- problem of uniqueness

- problem of warders

- programming problem

- properly posed problem

- purchasing problem

- pursuit problem

- puzzle problem

- pyramided problem

- quadratic programming problem

- quadrature problem

- quasilinear problem

- random-walk problem

- ranking problem

- realizability problem

- recursively enumerable problem
- recursively solvable problem
- reduced problem

- reducibility problem

- reducible problem

- regression problem

- relaxed problem

- rendezvous problem

- representation problem

- resource allocation problem

- restricted problem

- roulette problem

- routine problem

- ruin problem

- saddle point problem

- satisfiability problem

- scheduling problem

- schoolgirls problem

- scope of problem

- search problem

- secretary problem

- self-adjoint problem

- semidefinite problem

- separable problem

- separation problem

- sequencing problem

- sequential decision problem
- sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem
- singular problem

- solvable problem

- special problem

- specialization problem

- spectral problem

- stable marriage problem
- standard control problem
- statistical problem

- stereometric problem

- stiff problem

- stopping problem

- structural problem

- substitution problem

- symmetric problem

- systems analysis problem

- taxicab problem

- tenth problem

- termination problem

- ternary problem

- three body problem
- three houses and three wells problem
- three-choice problem

- three-color problem

- three-dimensional problem

- three-point problem

- timetable problem

- tournament problem

- toymaker problem

- trace problem

- tradeoff problem

- traffic problem

- trajectory problem

- transformed problem

- transport problem

- transportation problem

- transshipment problem

- trasport problem

- travelling salesman problem

- tree-structured problem

- triangulizability problem

- trigonometric moment problem

- trigonometric problem

- trim problem

- two body problem

- two noncharacteristic problem

- two-armed-bandit problem

- two-body problem

- two-choice problem

- two-dimensional problem

- two-means problem

- two-point boundary problem

- two-sample problem

- uncertainty problem

- unconstrained problem

- undecidable problem

- underspecified problem

- unicity problem

- universal problem

- unsolvable problem

- unstable problem

- unstructural problem

- unsymmetric dual problem

- variational problem

- waiting time problem

- warehousing problem

- well-behaved problem

- well-defined problem

- well-formulated problem

- well-set problem

- well-structured problem

- word problem

- worked problem

English-Russian scientific dictionary > problem

См. также в других словарях:

Polynomial-time approximation scheme — In computer science, a polynomial time approximation scheme (abbreviated PTAS) is a type of approximation algorithm for optimization problems (most often, NP hard optimization problems).A PTAS is an algorithm which takes an instance of an… … Wikipedia
Approximation algorithm — In computer science and operations research, approximation algorithms are algorithms used to find approximate solutions to optimization problems. Approximation algorithms are often associated with NP hard problems; since it is unlikely that there … Wikipedia
Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on … Wikipedia
Polynomial interpolation — In the mathematical subfield of numerical analysis, polynomial interpolation is the interpolation of a given data set by a polynomial. In other words, given some data points (such as obtained by sampling), the aim is to find a polynomial which… … Wikipedia
Function approximation — The need for function approximations arises in many branches of applied mathematics, and computer science in particular. In general, a function approximation problem asks us to select a function among a well defined class that closely matches (… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Tutte polynomial — This article is about the Tutte polynomial of a graph. For the Tutte polynomial of a matroid, see Matroid. The polynomial x4 + x3 + x2y is the Tutte polynomial of the Bull graph. The red line shows the intersection with the plane … Wikipedia
Steiner tree problem — Steiner tree for three points A, B, and C (note there are no direct connections between A, B, C). The Steiner point S is located at the Fermat point of the triangle ABC … Wikipedia
Knapsack problem — BKP redirects here. For other uses, see BKP (disambiguation). Example of a one dimensional (constraint) knapsack problem: which boxes should be chosen to maximize the amount of money while still keeping the overall weight under or equal to… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … Wikipedia

Словари и энциклопедии на Академике

Перевод: с английского на русский

polynomial approximation problem

См. также в других словарях:

Поделиться ссылкой на выделенное

Словари и энциклопедии на Академике

Перевод: с английского на русский

polynomial approximation problem

См. также в других словарях:

Поделиться ссылкой на выделенное

Прямая ссылка: